Solving an Open Sensor Exposure Problem using Variational Calculus

Sensor network presents us many new challenging practical and theoretical problems. This paper is concerned with minimal exposure problem in sensor networks. Exposure, proposed by Megerian and others [3] as a useful metric to describe the sensor coverage of a path in a sensor field, exhibits interesting properties and induces related open problems. In this paper, we present a solution to an open one-sensor exposure problem [2, 3] using variational calculus as our first step in further understanding of the exposure problem in multiple sensor scenarios

Spatiotemporal Multicast and Partitionable Group Membership Service

The recent advent of wireless mobile ad hoc networks and sensor networks creates many opportunities and challenges. This thesis explores some of them. In light of new application requirements in such environments, it proposes a new multicast paradigm called spatiotemporal multicast for supporting ad hoc network applications which require both spatial and temporal coordination. With a focus on a special case of spatiotemporal multicast, called mobicast, this work proposes several novel protocols and analyzes their performances. This dissertation also investigates implications of mobility on the classical group membership problem in distributed computing, proposes a new specification for a partitionable group membership service catering to applications on wireless mobile ad hoc networks, and provides a mobility-aware algorithm and middleware for this service. The results of this work bring new insights into the design and analysis of spatiotemporal communication protocols and fault-tolerant computing in wireless mobile ad hoc networks

The Design of Reliable Protocols for Wireless Traffic Signal System

Electronic traffic signal has the advantage of being easily visible to machines. It is expected to augment the traditional traffic light system in future intelligent transportation environments, where intelligent vehicles interact with each other and with traffic systems and give informed advisories to drivers. One problem with wireless signals is that they are essentially omnidirectional. Even if one uses directional wireless signaling source, it is not clear how any recipient of a signal can reliably determine whether the signal is meant for him or her, in the presence of signal reflections. In this paper, we present a basic electronic traffic signaling protocol framework and two reliable protocols for intersection traffic signal and stop sign signal. These protocols enable recipient vehicles to robustly differentiate the signal’s designated directions despite of potential threats(confusions) caused by reflections. We demonstrate how touse one of the protocol to construct a sample application: a red-light alert system. We also address potential inconsistency threats caused by the uncertainty of location system being used and discuss means to handle them

METHOD FOR SINGLE CRYSTAL GROWTH OF PHOTOVOLTAIC PEROVSKITE MATERIAL AND DEVICES

Systems and methods for perovskite single crystal growth include using a low temperature solution process that employs a temperature gradient in a perovskite solution in a container , also including at least one small perovskite single crystal , and a substrate in the solution upon which substrate a perovskite crystal nucleates and grows , in part due to the temperature gradient in the solution and in part due to a temperature gradient in the substrate . For example , a top portion of the substrate external to the solution may be cooled

SYSTEMS AND METHODS FOR SCALABLE PEROVSKITE DEVICE FABRICATION

Continuous processes for fabricating a perovskite device are described that include forming a perovskite layer or film on a substrate using a linear deposition device , and optionally using a conductive tape lamination process to form an anode or a cathode layer on the perovskite device

Relying on Safe Distance to Achieve Strong Partitionable Group Membership in Ad Hoc Networks

The design of ad hoc mobile applications often requires the availability of a consistent view of the application state among the participating hosts. Such views are important because they simplify both the programming and verification tasks. We argue that preventing the occurrence of unannounced disconnection is essential to constructing and maintaining a consistent view in the ad hoc mobile environment. In this light, we provide the specification for a partitionable group membership service supporting ad hoc mobile applications and propose a protocol for implementing the service. A unique property of this partitionable group membership is that messages sent between group members are guaranteed to be delivered successfully, given appropriate system assumptions. This property is preserved over time despite movement and frequent disconnections. The protocol splits and merges groups and maintains a logical connectivity graph based on a notion of safe-distance. An implementation of the protocol in Java is available for testing. The implementation is used to implement Lime 1, a middleware for mobility that supports transparent sharing of data in both wired and ad hoc wireless environments

On Maintaining Group Membership Data in Ad Hoc Networks

The design of ad hoc mobile applications often requires the availability of a consistent view of the application state among the participating hosts. Essential to constructing a consistent view is the ability to know what hosts are within proximity of each other, i.e., form a group in support of the particular application. In this paper we propose an algorithm that allows hosts within communication range to maintain a consistent view of the group membership despite movement and frequent disconnections. The novel features of this algorithm are its reliance on location information and a conservative notion of logical connectivity that creates the illusion of announced disconnection. Analysis of movement patterns and delays is used to anticipate physical disconnections before they can impact application results

Reliable Mobicast via Face-Aware Routing

This paper presents a novel protocol for a spatiotemporal variant of multicast called mobicast, designed to support message delivery in sensor and mobile ad hoc networks. The spatiotemporal character of mobicast relates to the obligation to deliver a message to all the nodes that will be present at time t in some geographic zone Z, where both the location and shape of the delivery zone are a function of time over some interval (tstart, tend). The protocol, called Face-Aware Routing (FAR), exploits ideas adapted from existing applications of face routing to achieve reliable mobicast delivery. The key features of the protocol are a routing strategy, which uses information confined solely to a node’s immediate spatial neighborhood, and a forwarding schedule, which employs only local topological information. Statistical results showing that, in uniformly distributed random disk graphs, the spatial neighborhood size is usually less than 20 suggest that FAR is likely to exhibit a low average memory cost. An estimation formula for the average size of the spatial neighborhood in random network is another analytical result reported in this paper. This paper also includes a novel and low cost distributed algorithm for spatial neighborhood discovery

Network Abstractions for Simplifying Mobile Application Development

Context-aware computing is characterized by the ability of a software system to continuously adapt its behavior to a changing environment over which it has little or no control. This style of interaction is imperative in ad hoc mobile networks that consist of numerous mobile hosts coordinating with each other opportunistically via transient wireless interconnections. In this paper, we provide a formal abstract characterization of a host’s context that extends to encompass a neighborhood within the ad hoc network. We provide an application in an ad hoc network a specification mechanism for defining such contexts that allows individual applications to tailor their operating contexts to their personalized needs. We describe a context maintenance protocol that provides this context abstraction in ad hoc networks through continuous evaluation of the context. This relieves the application developer of the obligation of explicitly managing mobility and its implications on behavior. The software engineering gains resulting from the use of this abstraction are measured through its expressiveness and simplicity of use. We also characterize the performance of this protocol in real ad hoc networks through simulation experiments. Finally, we describe an initial implementation of the abstraction and provide real world application examples demonstrating its use

Chloride Incorporation Process in CH\u3csub\u3e3\u3c/sub\u3eNH\u3csub\u3e3\u3c/sub\u3ePbI\u3csub\u3e3-x\u3c/sub\u3eCl\u3csub\u3ex\u3c/sub\u3e Perovskites via Nanoscale Bandgap Maps

CH3NH3PbI3-xClx perovskites enable fabrication of highly efficient solar cells. Chloride ions benefit the morphology, carrier diffusion length and stability of perovskite films; however, whether those benefits stem from the presence of Cl− in the precursor solution or from their incorporation in annealed films is debated. In this work, the photothermal induced resonance (PTIR), an in situ technique with nanoscale resolution, is leveraged to measure the bandgap of CH3NH3PbI3-xClx films obtained by a multicycle coating process that produces high efficiency (≈16 %) solar cells. Because chloride ions modify the perovskite lattice, thereby widening the bandgap, measuring the bandgap locally yields the local chloride content. After a mild annealing (60 min, 60°C) the films consist of Cl-rich (x \u3c 0.3) and Cl-poor phases that, upon further annealing (110 °C), evolve into a homogenous Cl-poorer (x \u3c 0.06) phase, suggesting that methylammonium-chrloride is progressively expelled from the film. Despite the small chloride content, CH3NH3PbI3-xClx films show better thermal stability up to 140 °C with respect CH3NH3PbI3 films fabricated with the same methodology